Mi manual de algoritmos/version_maraton_interuniversitaria_2008-2/src/java/io_file.java

   1 import java.io.*;
   2 import java.util.*;
   3 public class BooleanTree {
   4         public static void main(String[] args) throws FileNotFoundException {
   5                 System.setIn(new FileInputStream("tree.in"));
   6                 System.setOut(new PrintStream("tree.out"));
   7                 Scanner reader = new Scanner(System.in);
   8                 N = reader.nextInt();
   9                 for (int c = 1; c <= N; ++c) {
  10                         int res = 100;
  11                         if (res < 1000)
  12                                 System.out.println("Case #" + c + ": " + res);
  13                         else
  14                                 System.out.println("Case #" + c + ": IMPOSSIBLE");
  15                 }
  16         }
  17 }